A PTAS for Minimum d-Hop Underwater Sink Placement Problem in 2-d Underwater Sensor Networks

The multiple UnderWater Sink (UW-Sink) architecture is introduced to resolve the scalability problem in USNs. To maximize the benefit of this architecture, the UW-Sinks should be located carefully. Previously, we proposed Minimum d-Hop UW-Sink Placement Problem (MdHUWSPP) for time-sensitive applications, whose objective is minimizing the number of UW-Sinks which d-hop dominate a given USN. In this paper, we present a PTAS for MdHUWSPP. We introduce an algorithm to partition an input graph representing the USN, find local optimum solutions, and return the union of the